Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
نویسندگان
چکیده
AbstracrMirror sites enable client requests to be serviced by any of a number of servers, reducing load at individual servers and dispersing network load. Typically, a client requests service from a single mirror site. We consider enabling a client to access a file from multiple mirror sites in parallel to speed up the download. To eliminate complex client-server negotiations that a straightforward implementation of this approach would require, we develop a feedback-free protocol based on erasure codes. We demonstrate that a protocol using fast Tornado codes can deliver dramatic speedups at the expense of transmitting a moderate number of additional packets into the network. Our scalable solution extends naturally to allow multiple clients to access data from multiple mirror sites simultaneously. Our approach applies naturally to wireless networks and satellite networks as well.
منابع مشابه
Accessing Multiple Mirror Sites in Parallel Using Tornado Codes to Speed Up Downloads
This paper was published in the IEEE Infocom of 1999. The main objective, as the title suggested, is to speed up client download speed by accessing multiple mirror sites in parallel. The idea is to allow multiple senders in possession of the same file to simultaneously transmit data to the client using traditional end-to-end scheme, the data transmitted is the craftily encoded and sliced versio...
متن کاملAccessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads
Mirror sites enable client requests to be serviced by any of a number of servers, reducing load at individual servers and dispersing network load. Typically, a client requests service from a single mirror site. We consider enabling a client to access a file from multiple mirror sites in parallel to speed up the download. To eliminate complex client-server negotiations that a straightforward imp...
متن کاملResource Allocation in a Multicast Tree - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth reservation on links along its path from the source, and each link has a cost function depending on the amount of total bandwidth resewed at the link by all receivers using that link We formulate and solve a problem of a...
متن کاملMulticast Session Membership Size Estimation - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
AbsfructWe derive estimators and bounds that drive probabilistic polling algorithms for the estimation of the session size, n, of any.potentially large scale multicast session. We base our analysis upon a mapping of polling mechanisms to the problem of estimating the parameter n of the binomial ( n , p ) distribution. From the binomial model, we derive an interval estimator for n, and we charac...
متن کاملGeneralised Minimum Queuing Delay: An Adaptive Multi-rate Service Discipline for ATM Networks - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
In this paper, we propose a generalised minimum queuing delay (GMQD) service discipline for high speed networks, mainly asynchronous transfer mode (ATM) networks. This proposed scheme is similar to service disciplines based on fair queuing, but instead of using only a single service rate for each session for its entire connection lifetime, multiple service rates are used. The service rate of an...
متن کامل